Fusion Localization Algorithm Based on Robust IMM Model Combined with Semi-Definite Programming

نویسندگان

چکیده

With the continuous development of wireless sensor network (WSN) technology, WSN has gradually become one key technologies Internet, and is widely used in indoor target location technology. However, obstacles will have a great influence on distance measurement, it result large positioning error. Therefore, how to deal with non-line-of-sight (NLOS) error becomes an important problem. In this paper, Interacting Multiple Model (IMM) was identify NOLS/LOS. The NLOS probability calculated by Markov transform probability, likelihood function extended Kalman filter (EKF). compared LOS judge whether measurement contained A robust algorithm combining IMM model semidefinite programming (IMM-SDP) proposed. improved convex proposed reduce Simulation experimental results showed that can effectively achieve higher accuracy existing methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Semi-definite Programming Approach to Source Localization

A new algorithm based on semi-definite programming is presented for estimation of distributed source fields measured through a sensor array. The problem can be viewed as a subclass of inverse problems, which have been extensively investigated in the literature. Our approach is based on the so called information based complexity (IBC) paradigm, which formalizes the notion of seeking the set of a...

متن کامل

A semi-definite programming approach for robust tracking

Tracking problems are prevalent in the present day GPS and video systems. The problem of target tracking is a specific case of dynamic linear system estimation with additive noise. The most widely used filter for these systems is the Kalman Filter (KF). The optimality of the KF and similar Bayesian filters is guaranteed under particular probabilistic assumptions. However, in practice, and speci...

متن کامل

Semi-Definite Programming Relaxation for Non-Line-of-Sight Localization

We consider the problem of estimating the locations of a set of points in a k-dimensional euclidean space given a subset of the pairwise distance measurements between the points. We focus on the case when some fraction of these measurements can be arbitrarily corrupted by large additive noise. Given that the problem is highly non-convex, we propose a simple semidefinite programming relaxation t...

متن کامل

A flexible semi-definite programming approach for source localization problems

In this paper, a new semi-definite programming approach is devised for approximating nonlinear estimation problems. The main idea is to include the noise components as parameters of interests, which increases the flexibility in the convex optimization formulation. Using the source localization as an illustration, we develop semi-definite relaxation (SDR) positioning algorithms using angle-of-ar...

متن کامل

Positive Semi-definite Programming Localization in Wireless Sensor Networks

We propose an algorithm to locate an object with unknown coordinates based on the positive semi-definite programming in the wireless sensor networks, assuming that the squared error of the measured distance follows Gaussian distribution. We first obtain the estimator of the object location; then transform the non-convex problem to convex one by the positive semi-definite relaxation; and finally...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Actuators

سال: 2022

ISSN: ['2076-0825']

DOI: https://doi.org/10.3390/act11060146